Block transitive Steiner systems with more than one point orbit

نویسنده

  • David M. Evans
چکیده

For all ‘reasonable’ finite t, k and s we construct a t-(א0, k, 1) design and a group of automorphisms which is transitive on blocks and has s orbits on points. In particular, there is a 2-(א0, 4, 1) design with a block-transitive group of automorphisms having two point orbits. This answers a question of P. J. Cameron and C. E. Praeger. The construction is presented in a purely combinatorial way, but is a byproduct of a new way of looking at a model-theoretic construction of E. Hrushovski. 2000 Mathematics Subject Classification: 05B05 (Primary); 20B27 (Secondary) By a t-(v, k, λ) design we mean a set P of points, of cardinality v, together with a set B of blocks each of which is a k-subset of P , and which has the property that any set of t points is a subset of exactly λ blocks. An automorphism of the design (P,B) is simply a permutation of P which preserves B. It is well known that if G is a group of automorphisms of the design (P,B) and t ≥ 2 and v, k, λ are finite, then the number of G-orbits on P is no greater than the number of G-orbits on B: this is commonly referred to as Block’s Lemma ([1]). For the rest of the paper we suppose t ≥ 2, v is infinite and t, k, λ are finite. A standard model-theoretic trick (cf. [2], Section 2.2) shows that the actual infinite cardinality v is irrelevant to our concerns and we will emphasise this by referring to ‘t-(∞, k, λ) designs.’ However, in the designs we construct P will be countably infinite, so v is actually א0. It is known that Block’s Lemma need not hold for t-(∞, k, λ) designs. In unpublished work from 1995, the Author used ideas from [7] to construct a 2-(א0, 4, 14) design admitting a group of automorphisms with one block

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block Transitive Meager Squares over GF (q) for prime q

This paper shows the existence of a class of block transitive meager squares of order q on GF (q) for odd prime q, q large. Using these meager squares along with other known meager system constructions, we determine the spectrum of orders that admit meager systems: all odd n, n ≥ 9. Using this result, it is also determined that the spectrum of orders that admit 5-sparse Steiner triple systems i...

متن کامل

Permutation Groups with Multiply - Transitive Suborbits , Ii

In a previous paper with the same title [1], I considered the following situation; G is a primitive, not doubly transitive permutation group on Q, in which the stabiliser G a of a point a acts doubly transitively on an orbit F(a), where |F(a)| = v. Manning [3] showed that, if v > 2, then G a has an orbit larger than F(a). Indeed, with A = F* o T (see [1] for notation), it is easy to see that A(...

متن کامل

Nonexistence of sparse triple systems over abelian groups and involutions

In 1973 Paul Erdős conjectured that there is an integer v0(r) such that, for every v > v0(r) and v ≡ 1,3 (mod 6), there exists a Steiner triple system of order v, containing no i blocks on i + 2 points for every 1 < i ≤ r . Such an STS is said to be r-sparse. In this paper we consider relations of automorphisms of an STS to its sparseness. We show that for every r ≥ 13 there exists no point-tra...

متن کامل

Steiner t-Designs for Large t

One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial t-designs exist for all values of t, no non-trivial Steiner t-design with t > 5 has been constructed until now. Understandingly, the case t = 6 has received conside...

متن کامل

MaxMinSum Steiner Systems for Access-Balancing in Distributed Storage

Many code families such as low-density parity-check codes, fractional repetition codes, batch codes and private information retrieval codes with low storage overhead rely on the use of combinatorial block designs or derivatives thereof. In the context of distributed storage applications, one is often faced with system design issues that impose additional constraints on the coding schemes, and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004